// 数组题

// 并级 数组去重
const union= [...new Set([...arr1,...arr2])]

// 交接
const cross= [...new Set(arr1)].filter((item)=> arr2.includes(item))

// 差集
const undeff = union.filter( item=> !cross.includes(item))
